A Generic Speci cation for Verifying Peephole Optimizations

In this paper a generic speci cation for verifying local optimizations on machine code peephole optimization using the speci cation and veri ca tion system PVS is presented The scheme which provides useful de nitions basic properties and user de ned proof strategies abstracts from the speci c instruction set of a machine as well as from its semantics In addition we formally represent a stack machine as well as a two address machine The general scheme is applied to both machines and local optimizations are formalized and veri ed using the de ned proof strategies This research has been funded in part by the German Research Council DFG under project Veri x